Monotonicity in undirected networks

نویسندگان

چکیده

Abstract Is it always beneficial to create a new relationship (have follower/friend) in social network? This question can be formally stated as property of the centrality measure that defines importance actors network. Score monotonicity means adding an arc increases score target arc; rank improves relatively remaining nodes. It is known most centralities are both and monotone on directed, strongly connected graphs. In this paper, we study problem for classical measures case undirected networks: case, require score, or relative importance, at endpoints edge. We show that, surprisingly, situation very different, particular closeness, harmonic centrality, betweenness, eigenvector Seeley’s index, Katz’s PageRank not monotone; betweenness even monotone. other words, while good thing get follower, friend.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monotonicity in Bayesian Networks

For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable variables. We define two concepts of monotonicity to capture this type of knowledge. We say that a network is isotone in distribution if the probability distribution computed for the output variable given specific observati...

متن کامل

Network Coding in Undirected Networks

Recent work in network coding shows that, it is necessary to consider both the routing and coding strategies to achieve optimal throughput of information transmission in data networks. So far, most research on network coding has focused on the model of directed networks, where each communication link has a fixed direction. In this paper, we study the benefits of network coding in undirected net...

متن کامل

Influence Maximization in Undirected Networks

We consider the problem of finding a set of k vertices of maximal total influence in a given undirected network, under the independent cascade (IC) model of influence spread. It is known that influence is submodular in the IC model, and hence a greedy algorithm achieves a (1 − 1/e) approximation to this problem; moreover, it is known to be NP-hard to achieve a better approximation factor in dir...

متن کامل

Local Monotonicity in Probabilistic Networks

It is often desirable that a probabilistic network is monotone, e.g., more severe symptoms increase the likeliness of a more serious disease. Unfortunately, determining whether a network is monotone is highly intractable. Often, approximation algorithms are employed that work on a local scale. For these algorithms, the monotonicity of the arcs (rather than the network as a whole) is determined....

متن کامل

Mapping Semantic Networks to Undirected Networks

There exists an injective, information-preserving function that maps a semantic network (i.e a directed labeled network) to a directed network (i.e. a directed unlabeled network). The edge label in the semantic network is represented as a topological feature of the directed network. Also, there exists an injective function that maps a directed network to an undirected network (i.e. an undirecte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Network Science

سال: 2023

ISSN: ['2050-1250', '2050-1242']

DOI: https://doi.org/10.1017/nws.2022.42